Belief propagation on replica symmetric random factor graph models
نویسندگان
چکیده
منابع مشابه
Belief Propagation on Replica Symmetric Random Factor Graph Models
According to physics predictions, the free energy of random factor graph models that satisfy a certain “static replica symmetry” condition can be calculated via the Belief Propagation message passing scheme [20]. Here we prove this conjecture for a wide class of random factor graph models. Specifically, we show that the messages constructed just as in the case of acyclic factor graphs asymptoti...
متن کاملReplica Shuffled Belief Propagation Decoding on LDPC Codes
Replica shuffled belief propagation decoders of low-density parity-check codes are presented. The proposed decoders converge faster than standard and shuffled belief propagation decoders. Simulations shw that the new decoders offer good performance versus complexity trade-offs. Johns Hopkins University Conference on Information Sciences and Systems (CISS) This work may not be copied or reproduc...
متن کاملBelief propagation for graph partitioning
We study the belief propagation algorithm for the graph bipartitioning problem, i.e. the ground state of the ferromagnetic Ising model at a fixed magnetization. Application of a message passing scheme to a model with a fixed global parameter is not banal and we show that the magnetization can in fact be fixed in a local way within the belief propagation equations. Our method provides the full p...
متن کاملSymmetric Graph Regularized Constraint Propagation
This paper presents a novel symmetric graph regularization framework for pairwise constraint propagation. We first decompose the challenging problem of pairwise constraint propagation into a series of two-class label propagation subproblems and then deal with these subproblems by quadratic optimization with symmetric graph regularization. More importantly, we clearly show that pairwise constrai...
متن کاملReplica Shuffled Belief Propagation Decoding of LDPC Codes
Replica shuffled belief propagation decoders of low-density parity-check codes are presented. The proposed decoders converge faster than standard and shuffled belief propagation decoders. Simulations show that the new decoders offer good performance versus complexity trade-offs. This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l’Institut Henri Poincaré D
سال: 2018
ISSN: 2308-5827
DOI: 10.4171/aihpd/53